Melonic dominance and the largest eigenvalue of a large random tensor

نویسندگان

چکیده

We consider a Gaussian rotationally invariant ensemble of random real totally symmetric tensors with independent normally distributed entries, and estimate the largest eigenvalue typical tensor in this by examining rate growth initial vector under successive applications nonlinear map defined tensor. In limit large number dimensions, we observe that simple form melonic dominance holds, quantity study is effectively determined single Feynman diagram arising from average over components. This computation suggests our dimensions proportional to square root as it for matrices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Largest Eigenvalue Of Sparse Random Graphs

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely: λ1(G) = (1 + o(1))max{ √ ∆, np}, where ∆ is a maximal degree of G, and the o(1) term tends to zero as max{ √ ∆, np} tends to infinity.

متن کامل

Finding the Largest Eigenvalue of a Nonnegative Tensor

In this paper we propose an iterative method for calculating the largest eigenvalue of an irreducible nonnegative tensor. This method is an extension of a method of Collatz (1942) for calculating the spectral radius of an irreducible nonnegative matrix. Numerical results show that our proposed method is promising. We also apply the method to studying higher-order Markov chains.

متن کامل

On the largest eigenvalue of a symmetric nonnegative tensor

In this paper, some important spectral characterizations of symmetric nonnegative tensors are analyzed. In particular, it is shown that a symmetric nonnegative tensor has the following properties: (i) its spectral radius is zero if and only if it is a zero tensor; (ii) it is weakly irreducible (respectively, irreducible) if and only if it has a unique positive (respectively, nonnegative) eigenv...

متن کامل

On the largest-eigenvalue process for generalized Wishart random matrices

Using a change-of-measure argument, we prove an equality in law between the process of largest eigenvalues in a generalized Wishart random-matrix process and a last-passage percolation process. This equality in law was conjectured by Borodin and Péché (2008).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Letters in Mathematical Physics

سال: 2021

ISSN: ['0377-9017', '1573-0530']

DOI: https://doi.org/10.1007/s11005-021-01407-z